An improved strategy for solving Sudoku by sparse optimization methods

نویسندگان

  • Yuchao Tang
  • Zhenggang Wu
  • Chuanxi Zhu
چکیده

We proposed several strategies to improve the sparse optimization methods for solving Sudoku puzzles. Further, we defined a new difficult level for Sudoku. We tested our proposed methods on Sudoku puzzles data-set. Numerical results showed that we can improve the accurate recovery rate from 84%+ to 99%+ by the L1 sparse optimization method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

A Hybrid Heuristic Approach for the Sudoku problem

Sudoku is not only a popular puzzle but also an interesting constraint satisfaction problem. Therefore automatic solving methods for this problem have been the subject of several publications in the last decade. While some authors propose algorithms which make use of constraint programming techniques, others propose meta-heuristics and stochastic search to tackle larger instances of the puzzle....

متن کامل

EFFICIENCY OF IMPROVED HARMONY SEARCH ALGORITHM FOR SOLVING ENGINEERING OPTIMIZATION PROBLEMS

Many optimization techniques have been proposed since the inception of engineering optimization in 1960s. Traditional mathematical modeling-based approaches are incompetent to solve the engineering optimization problems, as these problems have complex system that involves large number of design variables as well as equality or inequality constraints. In order to overcome the various difficultie...

متن کامل

SudokuBee: An Artificial Bee Colony-based Approach in Solving Sudoku puzzles

Sudoku is a popular newspaper puzzle that has become an international phenomenon. Sudoku which means “single digits” is a logicbased combinatorial puzzle with rules that are quite simple. Several algorithms have been used to solve this combinatorial optimization problem. This paper explores the possibility of using the Artificial Bee Colony (ABC) algorithm, a relatively new swarm-based optimiza...

متن کامل

A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles

Sudoku is a logic-based combinatorial puzzle game which is popular among people of different ages. Due to this popularity, computer softwares are being developed to generate and solve Sudoku puzzles with different levels of difficulty. Several methods and algorithms have been proposed and used in different softwares to efficiently solve Sudoku puzzles. Various search methods such as stochastic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1507.05995  شماره 

صفحات  -

تاریخ انتشار 2015